Space Bounds for Infinitary Computation

نویسنده

  • Benedikt Löwe
چکیده

Infinite Time Turing Machines (or Hamkins-Kidder machines) have been introduced in [HaLe00] and their computability theory has been investigated in comparison to the usual computability theory in a sequence of papers by Hamkins, Lewis, Welch and Seabold: [HaLe00], [We00a], [We00b], [HaSe01], [HaLe02], [We04], [We05] (cf. also the survey papers [Ha02], [Ha04] and [Ha05]). Infinite Time Turing Machines have the same hardware as ordinary Turing Machines, and almost the same software. However, an Infinite Time Turing Machine can continue its computation if it still hasn’t reached the Halt state after infinitely many steps (for details, see § 1). In [Sc03], Schindler started the investigation of the corresponding complexity theory by defining natural time complexity classes for Infinite Time Turing Machines. Schindler, Welch, Hamkins and Deolalikar have proved with methods of descriptive set theory that the big open questions of standard complexity theory P ? = NP and P ? = NP ∩ coNP have negative answers for Infinite Time Turing Machines [Sc03,DeHaSc05,HaWe03]. For an ordinary Turing machine that stops in a finite number t of steps, it is easy to define its space usage: during its computation, it has used at most t cells of the tape, possibly less. This finite number of used cells can serve as a measure of space usage. A halting computation will have used a finite amount of time and space; if, however, time or space usage are infinite, then this corresponds to usage of order type ω and automatically implies that the computation was non-halting. In this paper, we shall consider both Hamkins-Kidder machines and Koepke’s Ordinal Machines as described in [Ko005a] and [Ko005b]. Koepke machines can not only extend their computation into transfinite ordinal time, but they also have ordinal-indexed cells on their tapes. Therefore, there is a natural notion of space usage for computations on Koepke machines that corresponds to the classical idea of space constraints on Turing Machines: just count the number (order type) of cells being used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Infinitary Term Graph Rewriting is Simple, Sound and Complete

Based on a simple metric and a simple partial order on term graphs, we develop two infinitary calculi of term graph rewriting. We show that, similarly to infinitary term rewriting, the partial order formalisation yields a conservative extension of the metric formalisation of the calculus. By showing that the resulting calculi simulate the corresponding well-established infinitary calculi of ter...

متن کامل

Lower Space Bounds for Randomized Computation

It is a fundamental open problem in the randomized computation how to separate diierent randomized time or randomized small space classes (cf., e.g., KV 87], KV 88]). In this paper we study lower space bounds for randomized computation, and prove lower space bounds up to log n for the speciic sets computed by the Monte Carlo Turing machines. This enables us for the rst time, to separate randomi...

متن کامل

A Survey on Stability Measure of Networks

In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.

متن کامل

Infinitary Algebraic Specifications for Stream Algebras

A stream is an infinite sequence of data from a set A. A wide variety of algorithms and architectures operate continuously in time, producing streams of data, for example: systolic arrays, data-flow machines, neural networks and cellular automata. Also many models of real number computation use streams. In this paper we study the construction of an algebra Ā of streams over a many-sorted algebr...

متن کامل

Reinterpreting Compression in Infinitary Rewriting

Departing from a computational interpretation of compression in infinitary rewriting, we view compression as a degenerate case of standardisation. The change in perspective comes about via two observations: (a) no compression property can be recovered for non-left-linear systems and (b) some standardisation procedures, as a ‘side-effect’, yield compressed reductions. 1998 ACM Subject Classifica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006